Path graph

Results: 1083



#Item
291CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap Hamidreza Chitsaz∗

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap Hamidreza Chitsaz∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:00:23
292Geometric Modeling with a Multiresolution Representation Richard Hammersley Hong-Qian (Karen) Lu  Steven Assa

Geometric Modeling with a Multiresolution Representation Richard Hammersley Hong-Qian (Karen) Lu Steven Assa

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2003-06-20 16:02:36
293CCCG 2013, Waterloo, Ontario, August 8–10, 2013  Zipper Unfolding of Domes and Prismoids Erik D. Demaine∗  Martin L. Demaine∗

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Zipper Unfolding of Domes and Prismoids Erik D. Demaine∗ Martin L. Demaine∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:56
294CCCG 2007, Ottawa, Ontario, August 20–22, 2007  The slider-pinning problem Audrey Lee  ∗†

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 The slider-pinning problem Audrey Lee ∗†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:27:03
295ISSNGRACE TECHNICAL REPORTS Bidirectionalizing Structural Recursion on Graphs

ISSNGRACE TECHNICAL REPORTS Bidirectionalizing Structural Recursion on Graphs

Add to Reading List

Source URL: www.biglab.org

Language: English - Date: 2011-01-08 13:03:57
296114  Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential

114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
297Graphs  Algorithms Lecture 18: Basic Graph Algorithms [Fa’14]

Graphs Algorithms Lecture 18: Basic Graph Algorithms [Fa’14]

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:41:03
298Finding a Minimal Tree in a Polygon with its Medial Axis Herman J. Haverkort 

Finding a Minimal Tree in a Polygon with its Medial Axis Herman J. Haverkort 

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2003-06-20 16:00:09
299CCCG 2007, Ottawa, Ontario, August 20–22, 2007  Hamilton Circuits in Hexagonal Grid Graphs Kamrul Islam(1) (1)

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Hamilton Circuits in Hexagonal Grid Graphs Kamrul Islam(1) (1)

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:25:51
300Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow

Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-10-05 20:16:31